Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
291	The Department of Computer Science of the Technische Universität Darmstadt invites applications for positions of Research Assistants in Cryptography and Complexity Theory both on doctoral and postdoctoral level, in the Add to Reading List Source URL: www.cryptoplexity.informatik.tu-darmstadt.de Language: English - Date: 2016-08-19 22:14:13 Darmstadt Technische Universitt Darmstadt Postdoctoral researcher Technische Hochschule Cryptography Doctor of Philosophy Habilitation Center for Advanced Security Research Darmstadt
292	MCS 441 – Theory of Computation I Spring 2016 Problem Set 5∗ Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-04-18 15:41:22 Complexity classes P versus NP problem NP IP P-complete
293	Canad. J. Math. Vol), 2005 pp. 328–337 On a Conjecture of Birch and Swinnerton-Dyer Wentang Kuo and M. Ram Murty Abstract. Let E/Q be an elliptic curve defined by the equation y 2 = x3 + ax + b. For a prime p, Add to Reading List Source URL: www.mast.queensu.ca Language: English - Date: 2016-03-21 17:34:11 Conjectures Analytic number theory Millennium Prize Problems Number theory Elliptic curve Group theory Birch and Swinnerton-Dyer conjecture Riemann hypothesis Abc conjecture Chain rule for Kolmogorov complexity
294	Exotlst_details_4_21_04.xls Add to Reading List Source URL: www.esd.ornl.gov Language: English - Date: 2004-05-26 15:21:32 Finite model theory Plant taxonomy Computational complexity theory Descriptive complexity Plant reproduction FO Monocotyledon Dicotyledon Seed SO Plant stem HO
295	CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-15 10:47:56 NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability
296	Computing Fundamentals Salvatore Filippone 2012–2013 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:12:56 Analysis of algorithms Computational complexity theory Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
297	Phil. Trans. R. Soc. B. article template Phil. Trans. R. Soc. B. doi:not yet assigned The neurobiology of uncertainty: implications for Add to Reading List Source URL: www.behaviometrix.com Language: English - Date: 2016-08-01 11:51:08 Cognition Decision theory Perception Sensory systems Neurology Insular cortex Cognitive science Uncertainty Perceptual learning Complexity Brain Decision-making
298	Prepared for: David Sallach et alThe First World Congress in Social Simulation. Kyoto, Japan: Springer. Agent-based Modeling Simulation of Social Adaptation and Long-Term Change in Inner Asia* Claudio Cioffi-Re Add to Reading List Source URL: cs.gmu.edu Language: English - Date: 2010-07-19 19:16:33 Complex systems theory Scientific modeling Systems theory Simulation Mathematical modeling Social complexity Social simulation Agent-based model Historical dynamics Economic model Cliodynamics Krasnow Institute for Advanced Study
299	Computing Fundamentals Salvatore Filippone 2013–2014 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2014-09-23 08:13:16 Computational complexity theory Analysis of algorithms Best worst and average case Time complexity Algorithm Fast Fourier transform Big O notation Average-case complexity Sorting algorithm
300	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set

UPDATE